منابع مشابه
Extracting MUSes
Minimally unsatisfiable subformulas (in short, MUSes) represent the smallest explanations for the inconsistency of SAT instances in terms of the number of involved clauses. Extracting MUSes can thus prove valuable because it circumscribes the sources of contradiction in an instance. In this paper, a new heuristic-based approach to approximate or compute MUSes is presented. It is shown that it o...
متن کاملOn Efficient Computation of Variable MUSes
In this paper we address the following problem: given an unsatisfiable CNF formula F , find a minimal subset of variables of F that constitutes the set of variables in some unsatisfiable core of F . This problem, known as variable MUS (VMUS) computation problem, captures the need to reduce the number of variables that appear in unsatisfiable cores. Previous work on computation of VMUSes propose...
متن کاملUsing Local Search to Find and MUSes
In this paper, a new complete technique to compute Maximal Satisfiable Subsets (MSSes) and Minimally Unsatisfiable Subformulas (MUSes) of sets of Boolean clauses is introduced. The approach improves the currently most efficient complete technique in several ways. It makes use of the powerful concept of critical clause and of a computationally inexpensive local search oracle to boost an exhausti...
متن کاملFinding a Collection of MUSes Incrementally
Minimal Unsatisfiable Sets (MUSes) are useful in a number of applications. However, in general there are many different MUSes, and each application might have different preferences over these MUSes. Typical Muser systems produce a single MUS without much control over which MUS is generated. In this paper we describe an algorithm that can efficiently compute a collection of MUSes, thus presentin...
متن کاملEnumerating Infeasibility: Finding Multiple MUSes Quickly
Methods for analyzing infeasible constraint sets have proliferated in the past decade, commonly focused on finding maximal satisfiable subsets (MSSes) or minimal unsatisfiable subsets (MUSes). Most common are methods for producing a single such subset (one MSS or one MUS), while a few algorithms have been presented for enumerating all of the interesting subsets of a constraint set. In the case ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Gerontology & Geriatric Research
سال: 2013
ISSN: 2167-7182
DOI: 10.4172/2167-7182.1000e123